Англо-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. . 1998-2007.
BNF — is an initialism with various meanings:Computer science*Backus–Naur Form, a formal grammar for expressing context free grammarsBiology and medicine*British National Formulary, the standard drug reference manual **British National Formulary for… … Wikipedia
Speech Recognition Grammar Specification — Die Speech Recognition Grammar Specification (SRGS) ist ein W3C Standard, der beschreibt, wie Spracherkennungs Grammatiken (engl. speech recognition grammars) spezifiziert werden. Eine Spracherkennungs Grammatik ist ein Reihe von Wortschemen, die … Deutsch Wikipedia
Speech Recognition Grammar Specification — (SRGS) is a W3C standard for how speech recognition grammars are specified. A speech recognition grammar is a set of word patterns, and tells a speech recognition system what to expect a human to say. For instance, if you call a voice directory… … Wikipedia
Context-free grammar — In formal language theory, a context free grammar (CFG) is a formal grammar in which every production rule is of the form V → w where V is a single nonterminal symbol, and w is a string of terminals and/or nonterminals (w can be empty). The… … Wikipedia
Formal grammar — In formal semantics, computer science and linguistics, a formal grammar (also called formation rules) is a precise description of a formal language ndash; that is, of a set of strings over some alphabet. In other words, a grammar describes which… … Wikipedia
Parsing expression grammar — A parsing expression grammar, or PEG, is a type of analytic formal grammar that describes a formal language in terms of a set of rules for recognizing strings in the language. A parsing expression grammar essentially represents a recursive… … Wikipedia
Syntax diagram — Syntax diagrams (or railroad diagrams) are a way to represent a formal grammar. They represent a graphical alternative to Backus Naur Form or EBNF. Early books using syntax diagrams include the Pascal User Manual written by Niklaus Wirth… … Wikipedia
Simple LR parser — In computer science, a Simple LR parser or SLR parser is created by an SLR parser generator which reads a BNF grammar and constructs an LR(0) state machine and computes the look aheads sets for each reduction in a state by examining the Follow… … Wikipedia
Forth (programming language) — infobox programming language name = Forth paradigm = Procedural, stack oriented year = 1970s designer = Charles H. Moore typing = typeless dialects = colorForth, Open Firmware implementations = Forth, Inc., GNU Forth, MPE influenced by =… … Wikipedia
C (programming language) — C The C Programming Language[1] (aka K R ) is the seminal book on C … Wikipedia
Administrative normal form — In computer science, administrative normal form (abbreviated ANF) is a canonical form of programs, which was introduced by Flanagan et al 1993 to serve as an intermediate representation in functional compilers to make subsequent transformations… … Wikipedia
